A High Performance Dynamic Token-Based Distributed Synchronization Algorithm
نویسندگان
چکیده
In this paper we propose a new dynamic token-based distributed synchronization algorithm that utilizes a new technique called optimistic broadcasting (optcasting) to improve efficiency. Briefly, an optcast message is a reliable unicast one that can also be heard by nodes other than its designated destination. Our algorithm manages pending token requesters by a distributed queue, and optcasts a direction towards the current queue end to help new requesters finding the queue end more quickly. Simulated experimental results indicate that our optcast algorithm outpelforms the already fast Chang-SinghalLiu (CSL) algorithm by up to 36%, especially for large systems of many processor nodes and under high synchronization loads. In addition, optcasting is highly robust and resistant to message loss, retaining at least 63% coverage even when the message loss, rate approaches 100%.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Token-Based Synchronization Scheme Using Epsilon-Serializability and Its Performance for Real-Time Distributed Database Systems
Schedulers for real-time distributed replicated databases must satisfy timing constraints of transactions and preserve data consistency. In this paper, we present a replication control algorithm, which integrates real-time scheduling and replication control. The algorithm adopts a token-based scheme for replication control and attempts to incorporate the urgency of real-time transactions into t...
متن کاملEvaluation of Token Based Mutual Exclusion Algorithms In Distributed Systems
This paper presents a framework for token based mutual exclusion algorithms in distributed systems. Their exists some traditional token based mutual exclusion algorithm. Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. In this paper, some new approaches are used, like Token ring algorithm with centralized appr...
متن کاملA Token-Based Fair Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a generalization of the mutual exclusion problem. In group mutual exclusion, a process requests a session before entering its critical section (CS). Processes requesting the same session are allowed to be in their CS simultaneously, however, processes requesting different sessions must execute their CS in mutually exclusive way. The paper presents a t...
متن کاملA False-Sharing Free Distributed Shared Memory Management Scheme
Distributed shared memory (DSM) systems on top of network of workstations are especially vulnerable to the impact of false sharing because of their higher memory transaction overheads and thus higher false sharing penalties. In this paper we develop a dynamic-granularity shared memory management scheme that eliminates false sharing without sacrificing the transparency to conventional shared-mem...
متن کامل